Gurmeet Singh Manku
نویسنده
چکیده
I joined the Ph.D. program at Stanford with the goal of designing and building large-scale systems. During my initial years, I enjoyed preparing for the Systems Quals. The numerous papers in operating systems, database systems, networks and distributed systems discussed in study-groups exposed me to the general philosophy underlying the art of building systems. In 2000, an internship at Gigabeat Inc. introduced me to peer-to-peer computing – I designed efficient crawlers for Gnutella and Icecast/Shoutcast servers. In November 2001, a couple of papers describing Distributed Hash Tables (DHTs) in peer-to-peer systems – can and chord – inspired me to work on DHTs. For my doctoral thesis, I have developed a modular architecture for DHTs that includes efficient algorithms for two sub-problems: ID management and routing network design.
منابع مشابه
Object tracking using affine structure for point correspondences
A new object tracking algorithm based on affine structure has been developed and it is shown that the performance is better than that of a Kalman filter based correlation tracker. The algorithm is fast, reliable, viewpoint invariant, and insensitive to occlusion and/or individual corner disappearance or reappearance. Detailed experimental analysis on a long real image sequence is also presented.
متن کاملA Loopless Gray Code for Minimal Signed-Binary Representations
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n = k≥0 ak2 k and the number of non-zero digits is minimal. We present a loopless (and hence a Gray code) algorithm for generating all minimal signed binary representations of a given integer n.
متن کاملA Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem
A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem is presented. This improves the hitherto best-known solution, which has a running time of 0( m + n log n), where m and n are the number of edges and vertices of the graph.
متن کاملA new voting based hardware data prefetch scheme
The dramatic increase in the processor-memory gap in recent years has led to the development of techniques like data prefetching that hide the latency of cache misses. Two such hardware techniques are the stream buuer and the stride predictor. They have dissimilar architectures, are eeective for diierent kinds of memory access patterns and require diierent amounts of extra memory bandwidth. We ...
متن کاملSymphony: Distributed Hashing in a Small World
We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance contacts drawn from a family of harmonic distributions. Through simulation, we demonstrate that our construction is scalable, exible, stable in the presence of frequent updates and o ers small average lat...
متن کامل